Matrix invariants of composite size

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cluj Matrix Invariants

The problem of distances in a graph, G, is one of the most studied questions, both from theoretical point of view and applications (the reader can consult two recent reviews ). It is connected to the Wiener number, W, or "the path number" as denominated by its initiator. In acyclic structures, Wiener number and its extension, hyper-Wiener number, can be defined as edge/path contributions, Ie/p ...

متن کامل

Computing with Matrix Invariants

This is an improved version of the talk of the author given at the Antalya Algebra Days VII on May 21, 2005. We present an introduction to the theory of the invariants under the action of GLn(C) by simultaneous conjugation of d matrices of size n × n. Then we survey some results, old or recent, obtained by a dozen of mathematicians, on minimal sets of generators, the defining relations of the a...

متن کامل

Model Programs for Preserving Composite Invariants

We describe a solution for the SAVCBS challenge problem: a technique for specifying and verifying invariants for objects designed using the Composite design pattern. The solution presents a greybox specification technique using JML’s model program feature. We show that model program specifications function as exemplars for capturing helper method calls in a way that preserves modularity and enc...

متن کامل

The Uniqueness of -Matrix Graph Invariants

In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix DMAX defined by Randić et al. In order to do so, we use exhaustively generated graphs instead of special graph classes such as trees only. Using these graph classes allow us to generalize the findings towards complex networks as they usually do not possess any structural const...

متن کامل

Size-Change Termination and Transition Invariants

Two directions of recent work on program termination use the concepts of size-change termination resp. transition invariants. The difference in the setting has as consequence the inherent incomparability of the analysis and verification methods that result from this work. Yet, in order to facilitate the crossover of ideas and techniques in further developments, it seems interesting to identify ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1992

ISSN: 0021-8693

DOI: 10.1016/0021-8693(92)90209-5